Recurrence relations versus succession rules

نویسندگان

  • Stefano Bilotta
  • Elisa Pergola
  • Renzo Pinzani
  • Simone Rinaldi
چکیده

In this paper we present a method to pass from a recurrence relation having constant coefficients (in short, a C-recurrence) to a finite succession rule defining the same number sequence. We recall that succession rules are a recently studied tool for the enumeration of combinatorial objects related to the ECO method. We also discuss the applicability of our method as a test for the positivity of a number sequence. keywords: Positivity problem; recurrence relation; succession rule.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recurrence Relations, Succession Rules, and the Positivity Problem

In this paper we present a method to pass from a given recurrence relation with constant coefficients (in short, a C-finite recurrence) to a finite succession rule defining the same number sequence. Our method consists in two steps: first, we transform the given recurrence relation into an extended succession rule, then we provide a series of operations to reduce such an extended succession rul...

متن کامل

A Seed-driven Bottom-up Machine Learning Framework for Extracting Relations of Various Complexity

A minimally supervised machine learning framework is described for extracting relations of various complexity. Bootstrapping starts from a small set of n-ary relation instances as “seeds”, in order to automatically learn pattern rules from parsed data, which then can extract new instances of the relation and its projections. We propose a novel rule representation enabling the composition of n-a...

متن کامل

Automatic rule discovery for field work in anthropology

This note deals with the problem of discovering rules that govern social interactions and relations in pre-literal societies. Two older computer programs are first described which can receive data, possibly incomplete and redundant, representing kinship relations among named individuals. The programs then establish a knowledge base in the form of a directed graph, which the user can query in a ...

متن کامل

A Note on Rational Succession Rules

Succession rules having a rational generating function are usually called rational succession rules. In this note we discuss some problems concerning rational succession rules, and determine a simple method to pass from a rational generating function to a rational succession rule, both defining the same number sequence. 2

متن کامل

Mixed succession rules: The commutative case

We begin a systematic study of the enumerative combinatorics of mixed succession rules, which are succession rules such that, in the associated generating tree, the nodes are allowed to produce their sons at several different levels according to different production rules. Here we deal with a specific case, namely that of two different production rules whose rule operators commute. In this situ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1301.2967  شماره 

صفحات  -

تاریخ انتشار 2013